Bio-Molecular Computing of Finite-State Machine

نویسنده

  • Yasubumi Sakakibara
چکیده

We overview a series of our research on implementing finite automata in vitro and in vivo in the framework of DNA-based computing [2, 3]. First, we employ the lengthencoding technique proposed and presented in [5, 4] to implement finite automata in test tube. In the length-encoding method, the states and state transition functions of a target finite automaton are effectively encoded into DNA sequences, a computation (accepting) process of finite automata is accomplished by self-assembly of encoded complementary DNA strands, and the acceptance of an input string is determined by the detection of a completely hybridized doublestrand DNA. Second, We report our intensive in vitro experiments in which we have implemented and executed several finite-state automata in test tube. We have designed and developed practical laboratory protocols which combine several in vitro operations such as annealing, ligation, PCR, and streptavidin-biotin bonding to execute in vitro finite automata based on the length-encoding technique. We have carried laboratory experiments on various finite automata of from 2 states to 6 states for several input strings. Third, we present a novel framework to develop a programmable and autonomous in vivo computer using Escherichia coli (E. coli), and implement in vivo finite-state automata based on the framework by employing the protein-synthesis mechanism of E. coli. Our fundamental idea to develop a programmable and autonomous finite-state automata on E. coli is that we first encode an input string into one plasmid, encode state-transition functions into the other plasmid, and introduce those two plasmids into an E. coli cell by electroporation. Fourth, we execute a protein-synthesis process in E. coli combined with four-base codon techniques to simulate a computation (accepting) process of finite automata, which has been proposed for in vitro translation-based computations in [4]. This approach enables us to develop a programmable in vivo computer by simply replacing a plasmid encoding a state-transition function with others. Further, our in vivo finite automata are autonomous because the Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Bionetics ’08, November 25-28, 2008, Hyogo, Japan Copyright 2008 ICST 978-963-9799-35-6 protein-synthesis process is autonomously executed in the living E. coli cell. We show some successful experiments to run an in vivo finite-state automaton on E. coli.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted cascade and wreath products of fuzzy finite switchboard state machines

A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...

متن کامل

Perspectives on Molecular Computing Perspectives on Molecular Computing X1 Jsps Project on Molecular Computers

In 1996, we began a research project on molecular computers under the new program \Research for the Future" funded by the Japan Society for the Promotion of Science. In this paper, we rst summarize the research that has been completed in the eld of DNA computing and the research problems that must be overcome. We also report some achievements of our research project in the rst two years. We the...

متن کامل

Performance Evaluation and Benchmarking of an Extended Computational Model of Ant Colony System for DNA Sequence Design

Ant colony system (ACS) algorithm is one of the biologically inspired algorithms that have been introduced to effectively solve a variety of combinatorial optimisation problems. In literature, ACS has been employed to solve DNA sequence design problem. The DNA sequence design problem was modelled based on a finite state machine in which the nodes represent the DNA bases {A, C, T, G}. Later in 2...

متن کامل

A New Method for Computation of Axial Flux Permanent Magnet Synchronous Machine Inductances under Saturated Condition

Accurate computing of the saturated inductances of Permanent Magnet Synchronous Machine (PMSM) is very important during the design process. In this paper, a new method is presented based on the B-H characteristic of the stator material and unsaturated inductances formulations. This method is used to calculate the saturated inductances of the axial flux PMSM. The synchronous inductance and all o...

متن کامل

Formal Techniques for Synchronized Fault-tolerant Systems 1

We present the formal veriication of synchronizing aspects of the Reliable Computing Platform (RCP), a fault-tolerant computing system for digital ight control applications. The RCP uses NMR-style redundancy to mask faults and internal majority voting to purge the eeects of transient faults. The system design has been formally speciied and veriied using the Ehdm veriication system. Our formaliz...

متن کامل

A Parallel State Assignment Algorithm for Finite State Machines

This paper summarizes the design and implementation of a parallel algorithm for state assignment of large Finite State Machines. High performance CAD tools are necessary to overcome the computational complexity involved in the optimization of large sequential circuits. FSMs constitute an important class of logic circuits and state assignment is one of the key steps in combinational logic optimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008